Two-tier relaxed heapsELMASRY, Amr; JENSEN, Claus; KATAJAINEN, Jyrki et al.Acta informatica. 2008, Vol 45, Num 3, pp 193-210, issn 0001-5903, 18 p.Article

The state complexity of L² and L^kRAMPERSAD, Narad.Information processing letters. 2006, Vol 98, Num 6, pp 231-234, issn 0020-0190, 4 p.Article

Quantizers and the worst-case Euclidean traveling salesman problemGODDYN, L. A.Journal of combinatorial theory. Series B. 1990, Vol 50, Num 1, pp 65-81, issn 0095-8956Article

A SHORT NOTE ON AN ADVANCE IN ESTIMATING THE WORST-CASE PERFORMANCE RATIO OF THE MPS ALGORITHMPALETTA, Giuseppe; VOCATURO, Francesca.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2198-2203, issn 0895-4801, 6 p.Article

In-place random list permutationsHWANG, W.-P; WANG, C.-L.Information processing letters. 1999, Vol 70, Num 6, pp 255-257, issn 0020-0190Article

CENTRAL SYMMETRY IN WORST CASE ESTIMATIONWITSENHAUSEN HS.1972; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1972; VOL. 18; NO 5; PP. 661-662; BIBL. 9 REF.Serial Issue

Q-ary Renyi-Ulam pathological liar game with one lieKUN MENG; CHUANG LIN; WEN AN LIU et al.Discrete applied mathematics. 2011, Vol 159, Num 6, pp 478-483, issn 0166-218X, 6 p.Article

Hat Guessing GamesBUTLER, Steve; HAJIAGHAYI, Mohammad T; KLEINBERG, Robert D et al.SIAM review (Print). 2009, Vol 51, Num 2, pp 399-413, issn 0036-1445, 15 p.Article

Dynamic rank/select structures with applications to run-length encoded textsLEE, Sunho; PARK, Kunsoo.Theoretical computer science. 2009, Vol 410, Num 43, pp 4402-4413, issn 0304-3975, 12 p.Article

Quantum circuit oracles for Abstract Machine computationsHINES, Peter.Theoretical computer science. 2010, Vol 411, Num 11-13, pp 1501-1520, issn 0304-3975, 20 p.Article

Tighter bounds of the First Fit algorithm for the bin-packing problemBINZHOU XIA; ZHIYI TAN.Discrete applied mathematics. 2010, Vol 158, Num 15, pp 1668-1675, issn 0166-218X, 8 p.Article

HAT GUESSING GAMESBUTLER, Steve; HAJIAGHAYI, Mohammad T; KLEINBERG, Robert D et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 2, pp 592-605, issn 0895-4801, 14 p.Article

The maximum gain of increasing the number of preemptions in multiprocessor schedulingKLONOWSKA, Kamilla; LUNDBERG, Lars; LENNERSTAD, Hakan et al.Acta informatica. 2009, Vol 46, Num 4, pp 285-295, issn 0001-5903, 11 p.Article

Multidimensional heaps and complementary range searchingBRASS, Peter.Information processing letters. 2007, Vol 102, Num 4, pp 152-155, issn 0020-0190, 4 p.Article

Structural tolerance and Delaunay triangulationABELLANAS, M; HURTADO, F; RAMOS, P. A et al.Information processing letters. 1999, Vol 71, Num 5-6, pp 221-227, issn 0020-0190Article

The Ajtai random class of latticesCUSICK, T. W.Theoretical computer science. 1999, Vol 226, Num 1-2, pp 29-36, issn 0304-3975Article

EXACT PRICE OF ANARCHY FOR POLYNOMIAL CONGESTION GAMESALAND, Sebastian; DUMRAUF, Dominic; GAIRING, Martin et al.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1211-1233, issn 0097-5397, 23 p.Article

A heuristic for the stacker Crane Problem on trees which is almost surely exactCOJA-OGHLAN, Amin; KRUMKE, Sven O; NIERHOFF, Till et al.Journal of algorithms (Print). 2006, Vol 61, Num 1, pp 1-19, issn 0196-6774, 19 p.Article

On-line uniform machine scheduling with rejectionHE, Y; MIN, X.Computing (Wien. Print). 2000, Vol 65, Num 1, pp 1-12, issn 0010-485XArticle

WORST-CASE ANALYSIS OF MEMORY ALLOCATION ALGORITHMSGAREY MR; GRAHAM RL; ULLMAN JD et al.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 143-150; BIBL. 7 REF.Conference Paper

Short correctness proofs for two self-stabilizing algorithms under the distributed daemon modelLIN, Ji-Cherng; CHIU, Ming-Yi.Discrete applied mathematics. 2009, Vol 157, Num 1, pp 140-148, issn 0166-218X, 9 p.Article

Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithmBERSTEL, Jean; BOASSON, Luc; CARTON, Olivier et al.Theoretical computer science. 2009, Vol 410, Num 30-32, pp 2811-2822, issn 0304-3975, 12 p.Article

A 3/2-APPROXIMATION ALGORITHM FOR SCHEDULING INDEPENDENT MONOTONIC MALLEABLE TASKSMOUNIE, Gregory; RAPINE, Christophe; TRYSTRAM, Denis et al.SIAM journal on computing (Print). 2008, Vol 37, Num 2, pp 401-412, issn 0097-5397, 12 p.Article

A note on the problem of reporting maximal cliquesCAZALS, F; KARANDE, C.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 564-568, issn 0304-3975, 5 p.Article

An approximation ratio for biclusteringPUOLAMÄKI, Kai; HANHIJÄRVI, Sami; GARRIGA, Gemma C et al.Information processing letters. 2008, Vol 108, Num 2, pp 45-49, issn 0020-0190, 5 p.Article